Extended Euclidean Algorithm and CRT Algorithm
نویسندگان
چکیده
منابع مشابه
Extended Euclidean Algorithm and CRT Algorithm1
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is ...
متن کاملOn a Parallel Extended Euclidean Algorithm
A new parallelization of Euclid’s greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel Oε(n/log n) time using only n processors on a Priority CRCW PRAM.
متن کاملOn the Complexity of the Extended Euclidean Algorithm (extended abstract)
Euclid’s algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known ([10]). This algorithm can be amplified naturally in various ways. The GCD problem for more than two numbers is interesting in its own right. Thus, we can use Euclid’s algorithm recursively to compute the GCD of more than two numbers. Also, we can do a constructive com...
متن کاملThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملA One-Way Function Based On The Extended Euclidean Algorithm
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signatures. Let ) (x P and ) (x Q be polynomials defined over the Integers modulo a prime integer p with ) 1 ( ) ( ) ( 1 p x x Q x P p mod . Also let ) (x A be a polynomial such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2012
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-012-0020-2